Block-separable linking constraints in augmented Lagrangian coordination
نویسندگان
چکیده
منابع مشابه
Consistency Constraint Allocation in Augmented Lagrangian Coordination
Many engineering systems are too complex to design as a single entity. Decomposition-based design optimization methods partition a system design problem into subproblems, and coordinate subproblem solutions toward an optimal system design. Recent work has addressed formal methods for determining an ideal system partition and coordination strategy, but coordination decisions have been limited to...
متن کاملGlobal and Adaptive Scaling in a Separable Augmented Lagrangian Algorithm
Abstract. In this paper, we analyze the numerical behaviour of a separable Augmented Lagrangian algorithm with multiple scaling parameters, different parameters associated with each dualized coupling constraint as well as with each subproblem. We show that an optimal superlinear rate of convergence can be theoretically attained in the twice differentiable case and propose an adaptive scaling st...
متن کاملAugmented Lagrangian Coordination for Decomposed Design Problems
Designing large-scale systems frequently involves solving a complex mathematical program that requires, for various reasons, decomposition into a number of smaller systems. Practical studies have proved the effectiveness of multilevel hierarchical methods at early stages of design; these methods divide a large program into multiple levels and multiple systems at each level and the result is kno...
متن کاملSeparable Approximations and Decomposition Methods for the Augmented Lagrangian
In this paper we study decomposition methods based on separable approximations for minimizing the augmented Lagrangian. In particular, we study and compare the Diagonal Quadratic Approximation Method (DQAM) of Mulvey and Ruszczyński [13] and the Parallel Coordinate Descent Method (PCDM) of Richtárik and Takáč [23]. We show that the two methods are equivalent for feasibility problems up to the s...
متن کاملLagrangian decomposition of block-separable mixed-integer all-quadratic programs
e-mail: [email protected] Abstract. The purpose of this paper is threefold. First we propose splitting schemes for reformulating non-separable problems as block-separable problems. Second we show that the Lagrangian dual of a block-separable mixed-integer all-quadratic program (MIQQP) can be formulated as an eigenvalue optimization problem keeping the block-separable structure. Finall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Structural and Multidisciplinary Optimization
سال: 2008
ISSN: 1615-147X,1615-1488
DOI: 10.1007/s00158-008-0244-5